Pii: S0167-8396(02)00146-2
نویسندگان
چکیده
This paper compares the performance and efficiency of different function range interval methods for plotting f (x, y)= 0 on a rectangular region based on a subdivision scheme, where f (x, y) is a polynomial. The solution of this problem has many applications in CAGD. The methods considered are interval arithmetic methods (using the power basis, Bernstein basis, Horner form and centred form), an affine arithmetic method, a Bernstein coefficient method, Taubin’s method, Rivlin’s method, Gopalsamy’s method, and related methods which also take into account derivative information. Our experimental results show that the affine arithmetic method, interval arithmetic using the centred form, the Bernstein coefficient method, Taubin’s method, Rivlin’s method, and their related derivative methods have similar performance, and generally they are more accurate and efficient than Gopalsamy’s method and interval arithmetic using the power basis, the Bernstein basis, and Horner form methods. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Comparison of interval methods for plotting algebraic curves
This paper compares the performance and efficiency of different function range interval methods for plotting f(x, y) = 0 on a rectangular region based on a subdivision scheme, where f(x, y) is a polynomial. The solution of this problem has many applications in CAGD. The methods considered are interval arithmetic methods (using the power basis, Bernstein basis, Horner form and centred form), aff...
متن کاملPii: S0167-8396(02)00164-4
We study the relationship of transformations between Legendre and Bernstein basis. Using the relationship, we present a simple and efficient method for optimal multiple degree reductions of Bézier curves with respect to the L2-norm. 2002 Elsevier Science B.V. All rights reserved.
متن کاملPii: S0167-8396(02)00090-0
This paper gives an algorithm for computing proper polynomial parametrizations for a particular class of curves. This class is characterized by the existence of a polynomial parametrization and by the absence of affine singularities. The algorithm requires O(n3 logn) field operations, where n is the degree of the curve. 2002 Elsevier Science B.V. All rights reserved.
متن کاملRefinement operators for triangle meshes
Refinement operators for triangular meshes as used in subdivision schemes or remeshing are discussed. A numbering scheme is presented, covering all refinement operators that (topologically) map vertices onto vertices. Using this characterization, some special properties of n-adic and √ 3-subdivision are easy to see.
متن کاملTotal least squares fitting of Bézier and B-spline curves to ordered data
We begin by considering the problem of fitting a single Bézier curve segment to a set of ordered data so that the error is minimized in the total least squares sense. We develop an algorithm for applying the Gauss–Newton method to this problem with a direct method for evaluating the Jacobian based on implicitly differentiating a pseudo-inverse. We then demonstrate the simple extension of this a...
متن کامل